A generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progression

نویسندگان

  • Yu-Ru Liu
  • Craig V. Spencer
چکیده

Let r1, . . . , rs be non-zero integers satisfying r1 + · · ·+ rs = 0. Let G ' Z/k1Z⊕ · · · ⊕ Z/knZ be a finite abelian group with ki|ki−1 (2 ≤ i ≤ n), and suppose that (ri, k1) = 1 (1 ≤ i ≤ s). Let Dr(G) denote the maximal cardinality of a set A ⊆ G which contains no non-trivial solution of r1x1 + · · · + rsxs = 0 with xi ∈ A (1 ≤ i ≤ s). We prove that Dr(G) |G|/ns−2. We also apply this result to study problems in finite projective spaces.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progression (II)

Let G ' Z/k1Z⊕ · · · ⊕ Z/kNZ be a finite abelian group with ki|ki−1 (2 ≤ i ≤ N). For a matrix Y = ( ai,j ) ∈ ZR×S satisfying ai,1 + · · ·+ ai,S = 0 (1 ≤ i ≤ R), let DY (G) denote the maximal cardinality of a set A ⊆ G for which the equations ai,1x1 + · · · + ai,SxS = 0 (1 ≤ i ≤ R) are never satisfied simultaneously by distinct elements x1, . . . , xS ∈ A. Under certain assumptions on Y and G, w...

متن کامل

Self-similar fractals and arithmetic dynamics

‎The concept of self-similarity on subsets of algebraic varieties‎ ‎is defined by considering algebraic endomorphisms of the variety‎ ‎as `similarity' maps‎. ‎Self-similar fractals are subsets of algebraic varieties‎ ‎which can be written as a finite and disjoint union of‎ ‎`similar' copies‎. ‎Fractals provide a framework in which‎, ‎one can‎ ‎unite some results and conjectures in Diophantine g...

متن کامل

On non-normal non-abelian subgroups of finite groups

‎In this paper we prove that a finite group $G$ having at most three‎ ‎conjugacy classes of non-normal non-abelian proper subgroups is‎ ‎always solvable except for $Gcong{rm{A_5}}$‎, ‎which extends Theorem 3.3‎ ‎in [Some sufficient conditions on the number of‎ ‎non-abelian subgroups of a finite group to be solvable‎, ‎Acta Math‎. ‎Sinica (English Series) 27 (2011) 891--896.]‎. ‎Moreover‎, ‎we s...

متن کامل

Pairwise‎ ‎non-commuting elements in finite metacyclic $2$-groups and some finite $p$-groups

Let $G$ be a finite group‎. ‎A subset $X$ of $G$ is a set of pairwise non-commuting elements‎ ‎if any two distinct elements of $X$ do not commute‎. ‎In this paper‎ ‎we determine the maximum size of these subsets in any finite‎ ‎non-abelian metacyclic $2$-group and in any finite non-abelian $p$-group with an abelian maximal subgroup‎.

متن کامل

A Probabilistic Technique for Finding Almost-periods of Convolutions

We introduce a new probabilistic technique for finding ‘almost-periods’ of convolutions of subsets of groups. This gives results similar to the Bogolyubov-type estimates established by Fourier analysis on abelian groups but without the need for a nice Fourier transform to exist. We also present applications, some of which are new even in the abelian setting. These include a probabilistic proof ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Des. Codes Cryptography

دوره 52  شماره 

صفحات  -

تاریخ انتشار 2009